Efficient solution for a class of Markov chain models of tandem queueing networks
نویسندگان
چکیده
We present a new numerical method for the computation of the steady-state solution of Markov chains. Theoretical analyses show that the proposed method, with a contraction factor α, converges to the one-dimensional null space of singular linear systems of the form Ax = 0. Numerical experiments are used to illustrate the effectiveness of the proposed method, with applications to a class of interesting models in the domain of tandem queueing networks. Keywords—Markov chains, tandem queueing networks, convergence, effectiveness.
منابع مشابه
A class of hierarchical queueing networks and their analysis
Queueing networks are an adequate model type for the analysis of complex system behavior. Most of the more realistic models are rather complex and do not fall into the easy solvable class of product form networks. Those models have to be analyzed by numerical solution of the underlying Markov chain and/or approximation techniques including simulation. In this paper a class of hierarchically str...
متن کاملA Queueing Model of General Servers in Tandem with Finite Buffer Capacities
We consider a queueing model with finite capacities. External arrivals follow a Coxian distribution. Due to the limitation of the capacity, arrivals may be lost if the buffer is full. Our goal is to study the probability of blocking. In order to obtain the steady-state probability distribution of this model, we construct an embedded Markov chain at the departure points. The solution is solved ...
متن کاملApproximate Analysis of Tandem Blocking Queueing Networks with Correlated Arrivals and Services
Many real systems such as production lines are modeled as queueing networks with finite buffers. In such a queueing model, blocking occurs if a customer attempts to enter the next queue whose buffer is full and not available. In this case, the customer is forced to wait until the next queue can be entered. General queueing networks with blocking do not have a product-form solution. Therefore, i...
متن کاملOde Methods for Skip-free Markov Chain Stability with Applications to Mcmc
Abstract. Fluid limit techniques have become a central tool to analyze queueing networks over the last decade, with applications to performance analysis, simulation, and optimization. In this paper some of these techniques are extended to a general class of skip-free Markov chains. As in the case of queueing models, a fluid approximation is obtained by scaling time, space, and the initial condi...
متن کاملThe ODE method for stability of skip-free Markov chains with applications to MCMC
Fluid limit techniques have become a central tool to analyze queueing networks over the last decade, with applications to performance analysis, simulation and optimization. In this paper, some of these techniques are extended to a general class of skip-free Markov chains. As in the case of queueing models, a fluid approximation is obtained by scaling time, space and the initial condition by a l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013